Minimal generation of basic semialgebraic sets
نویسندگان
چکیده
منابع مشابه
Approximate Volume and Integration for Basic Semialgebraic Sets
Given a basic compact semi-algebraic set K ⊂ R n , we introduce a methodology that generates a sequence converging to the volume of K. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear programs. Not only the volume but also every finite vector of moments of the probability measure that is uniformly distributed on K can be approximated as closely as de...
متن کاملPixelations of planar semialgebraic sets
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the normal cycle of Sr converges to the normal cycle of S in the sense of currents. In particular,...
متن کاملMinimizing Polynomials Over Semialgebraic Sets
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...
متن کاملAutomatic Generation of Minimal Cut Sets
A cut set is a collection of component failure modes that could lead to a system failure. Cut Set Analysis (CSA) is applied to critical systems to identify and rank system vulnerabilities at design time. Model checking tools have been used to automate the generation of minimal cut sets but are generally based on checking reachability of system failure states. This paper describes a new approach...
متن کاملThe Generation of Minimal Tests Sets and Some Minimal Tests
In this paper the method for a problem solution of expenditures reduction of computing resources and time is developed at a pattern recognition. The way of construction of the minimum tests sets or separate minimum tests on Boolean matrixes is suggested. Some minimum tests can be received by using a consequence for improvement of the minimum test length from the theorem given in paper. It is po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1984
ISSN: 0035-7596
DOI: 10.1216/rmj-1984-14-4-935